Once again, we use a programming problem from Project Euler, but this time it's Problem No.2. 同样地,我们仍然使用ProjectEuler中的一个编程问题,但是这次,它是问题2。
For the first example, we will take the following programming problem. 在第一个示例中,我们将处理下述的编程问题。
A DSL, or domain-specific language, is a scripted language designed to solve a specific programming problem. 一个DSL或域特定语言是一种旨在解决特定编程问题的脚本语言。
Fortunately, Erlang has a solution for this distributed programming problem too. 幸运的是,Erlang同样为这种分布式编程问题提供了解决方案。
The quadratic-linear bilevel programming problem in general form is dealt with in this paper. 研究具有一般形式的凸二次-线性双层规划问题。
An on-line training algorithm is presented to avoid repetitious solving the convex programming problem. 并给出一种?着调整时的在线训练算法,避免重复求解凸规划问题。
The fixed charge transportation problem ( FCTP) is a special linear programming problem. 固定费用运输问题是一种特殊的线性规划问题。
Linear Programming Problem Sensitivity Analysis and Applications 线性规划问题的灵敏度分析及其应用
Objective: To study the graphical method for goal programming problem whose goal function has multi-deviation variables in the same priority level. 目的:研究了对目标函数中同一优先级内含有多个带权偏差变量的目标规划问题的图解方法。
Traditional short-term line maintenance scheduling is always formulated as a stochastic programming problem. 传统方法将短期线路检修计划作为单重不确定性优化问题进行建模和求解。
Firstly, this article transform the fractional programming problem with polytope constraints to an equivalent problem. 分式规划问题是一类被广泛研究的非线性规划问题。
In the present paper, a type of higher order dual model is formulated for minimax fractional programming problem. 提出了一个非线性规划的对称对偶模型,它统一了非线性规划中两类对称模型。
A deterministic global optimization algorithm is proposed for a class of fractional programming problem ( P1), which can be generally applied to engineering. 对广泛应用于工程中一类比式规划问题(P1)给出了一个确定性全局优化算法。
This paper researches the computer solving method of large-scale integer programming problem which is abstracted from enterprise business process management. 对从企业业务流程管理中抽象出来的大规模整数规划问题的计算机求解方法进行讨论。
In this paper, a sort of optimal inventory model with postponement strategy i.e.bilevel integer programming problem was researched. 考虑一类带延迟策略的库存优化模型,即二层整数规划问题。
A reduced branch and bound approach for solving quadratic programming problem with quadratic constraints; 提出了一种结构计算模型修正的二次约束最小二乘方法。
Solution to Integer Programming Problem Based on Particle Swarm Optimization 基于粒子群算法的整数规划问题的求解算法
Results: Area graphical method for goal programming problem with two decision variables is obtained. 结果:给出了求解具有两个决策变量的目标规划问题的完整方法-分区图解法。
A new method is applied to a kind of nonlinear programming problem with monotonic functions and non-monotonic objective functions. 给出了一类约束函数单调而目标函数非单调的非线性规划问题的一种新的求解方法。
Study on the Algorithms of Bilevel Programming Problem in Management System 管理系统中双层优化问题的算法研究
Research on DNA Algorithm of 0-1 Programming Problem 0-1规划问题的DNA计算算法研究
Solution of Linear Programming Problem and Sensitivity Analysis by Excel 如何利用EXCEL求解线性规划问题及其灵敏度分析
Design and Research of Programming Problem Scoring About Online Examination System 网上考试系统程序设计题的评分设计与研究
A multiobjective linear programming problem in which all coefficients are fuzzy numbers is considered in this paper. 讨论了一类所有系数均为模糊数的多目标线性规划问题。
This paper analyzes the kernel matrix in the linear programming problem and proposes a new revised prime-dual algorithm based on the kernel matrix. 本文通过对线性规划问题中的核心矩阵的分析,提出了一种基于核心矩阵的原始对偶算法。
Genetic algorithm based on natural evolutionism is a good method to resolve complicated nonlinear programming problem. 基于自然进化原理的遗传算法是一种解决复杂非线性规划问题十分有前景的方法。
A design pattern describes a solution to a common programming problem or scenario. 一个设计模式描述一个共有的程序问题的解决办法或者情况。
In this paper, the concept of generalized KT-properly efficient solution of multiobjective programming problem in normed linear space is introduced. 对于赋范线性空间中的多目标规划问题,引进了广义KT-真有效解的概念。
In this paper, several efficiency sufficient conditions for major-efficient solutions and weakly major-efficient solutions of multiobjective nonlinear programming problem are given and proved. 对于带不等式和等式结束的多目标非线性规划问题,给出并证明了它的较多有效解和弱较多有效解的几个有效性充分条件。
The process of which is to solve the integer programming problem with the objective function that RMSE is minimal. 选择最优参数的过程即是对以均方根误差最小为目标的整数规划问题的求解过程。